Polygon-to-Function Conversion for Sweeping
نویسندگان
چکیده
This paper describes an approach to the representation of polygons by real functions and its application to sweeping. We combine an algorithm employing a monotone function of a boolean operation, with R-functions. Application of this method results in a continuous function F(x,y) with zero value at polygon edges. We discuss and illustrate different sweeping techniques with the use of functionally defined generators.
منابع مشابه
Computing nice sweeps for polyhedra and polygons
The plane sweep technique is one of the best known paradigms for the design of geometric algorithms [2]. Here an imaginary line sweeps over the plane while computing the property of interest at the moment the sweep line passes the required information needed to compute that property. There are also three-dimensional problems that are solved by space sweep, where a plane sweeps the space. This p...
متن کاملSimple Characterization of Polygons Searchable by 1-Searcher (Revised)
Suppose intruders are in a dark polygonal room and they can move arbitrarily fast, trying to avoid detection. A boundary 1-searcher can move along the polygon boundary, equipped with a flash light that she can direct in any direction. A polygon is searchable if there is a schedule for the searcher in order to detect the intruders no matter how they move. We identify three simple forbidden patte...
متن کاملAlgorithms for Computing Grazing Area
We consider the problem of sweeping (or grazing) the inte-rior/exterior of a polygon by a exible rope whose one end point (anchor) is attached on the boundary of the polygon. We present a linear time algorithm to compute the grazing area inside a simple polygon. We show how to extend the algorithm for computing the internal grazing area, without increasing its time complexity, to compute the gr...
متن کاملHigh Order Fast Sweeping Methods for Static Hamilton-Jacobi Equations
We construct high order fast sweeping numerical methods for computing viscosity solutions of static Hamilton-Jacobi equations on rectangular grids. These methods combine high order weighted essentially non-oscillatory (WENO) approximation to derivatives, monotone numerical Hamiltonians and Gauss Seidel iterations with alternating-direction sweepings. Based on well-developed first order sweeping...
متن کاملAn Analytical Solution for Inverse Determination of Residual Stress Field
An analytical solution is presented that reconstructs residual stress field from limited and incomplete data. The inverse problem of reconstructing residual stresses is solved using an appropriate form of the airy stress function. This function is chosen to satisfy the stress equilibrium equations together with the boundary conditions for a domain within a convex polygon. The analytical solu...
متن کامل